SNR-dependent radius control sphere detection for MIMO systems and relay networks
نویسندگان
چکیده
A new sphere decoder algorithm for uncoded spatial multiplexing multiple-input multiple-output (MIMO) systems is proposed. It overcomes the drawbacks of traditional sphere decoders: variable complexity and high complexity in low signal-to-noise ratios (SNRs). Its main novelty lies in scaling the search radius by a heuristic SNR-dependent factor. This new SNR-dependent radius control sphere decoder offers near maximum likelihood performance over the entire range of SNRs, while keeping its complexity roughly constant. This algorithm also incorporates channel ordering to save complexity. To quantify the variability of complexity, the normalised variance of the complexity is evaluated. This algorithm is also extended for joint iterative detection and decoding in coded MIMO systems and for MIMO-relay networks. Simulation results and theoretical analysis demonstrate the benefits of the proposed algorithm. Copyright © 2013 John Wiley & Sons, Ltd. *Correspondence C. Tellambura, Department of Electrical and Computer Engineering, University Alberta, Edmonton, AB, Canada T6G 2V4. E-mail: [email protected] This paper was presented in part at the IEEE International Conference on Communications (ICC), June 2011, Kyoto, Japan. Received 31 July 2012; Revised 31 December 2012; Accepted 6 January 2013
منابع مشابه
Sphere-based list Forwarding Strategy for MIMO Relay Networks
A sphere-based list forwarding scheme for multipleinput multiple-output (MIMO) relay networks is proposed and analysed. Firstly, an estimate forwarding (EF) methods is proposed, which forwards the minimum mean squared error (MMSE) estimate of the source data to the destination. Since it performs like amplify-and-forward (AF) and decode-and-forward (DF) for the low and high signal-to-noise ratio...
متن کاملComplexity analysis of MIMO sphere decoder using radius choice and increasing radius algorithms
Maximum Likelihood (ML) detection is the optimum method for decoding the received signal vector in communication systems. Its complexity increases with the number of antennas and the constellation size. Sphere Decoding (SD) is an alternate for ML detection. Although SD significantly reduces the complexity of MIMO-ML decoding, its complexity remains too high to apply it for practical systems. As...
متن کاملCooperative Orthogonal Space-Time-Frequency Block Codes over a MIMO-OFDM Frequency Selective Channel
In this paper, a cooperative algorithm to improve the orthogonal space-timefrequency block codes (OSTFBC) in frequency selective channels for 2*1, 2*2, 4*1, 4*2 MIMO-OFDM systems, is presented. The algorithm of three node, a source node, a relay node and a destination node is formed, and is implemented in two stages. During the first stage, the destination and the relay antennas receive the sym...
متن کاملRadius Choice Algorithm for Complexity Reduction of Probabilistic Tree Pruning Sphere Decoder for MIMO Systems
In digital communication systems, Maximum likelihood (ML) detection is the optimum method to decode a received signal vector. In wireless communication systems, the complexity increases with the constellation size and the number of antennas. It becomes infeasible to apply ML decoding to the practical systems as it searches through all the lattice points in the constellation. Sphere decoding is ...
متن کاملNew 2-D Adaptive K-Best Sphere Detection for Relay Nodes
Relay nodes are the main players of cooperative networks that used to improve the system performance and to offer virtual multiple antennas for limited antenna devices in a multi-user environment. However, employing relaying strategies requires considerable resources at the relay side and places a large burden on the relay helping node especially when considering the power consumption. Partial ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Trans. Emerging Telecommunications Technologies
دوره 26 شماره
صفحات -
تاریخ انتشار 2015